#include <bits/stdc++.h>
using namespace std;
struct Work {
  int d;
  int t;
};
Work w[200005];
long long prifixSum[200005];
bool cmp(Work a, Work b) { return a.d < b.d; }
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> w[i].d >> w[i].t;
  }

  sort(w + 1, w + n + 1, cmp);

  for (int i = 1; i <= n; i++) {
    prifixSum[i] = prifixSum[i - 1] + w[i].t;
  }
  // 从第一个开始，有可能第一个任务都无法完成
  for (int i = 1; i <= n; i++) {
    if (prifixSum[i] > w[i].d) {
      cout << "No";
      return 0;
    }
  }
  cout << "Yes";
  return 0;
}